numeral subset - ترجمة إلى الروسية
Diclib.com
قاموس ChatGPT
أدخل كلمة أو عبارة بأي لغة 👆
اللغة:

ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT

في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:

  • كيف يتم استخدام الكلمة في اللغة
  • تردد الكلمة
  • ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
  • خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
  • أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
  • أصل الكلمة

numeral subset - ترجمة إلى الروسية

DECISION PROBLEM IN COMPUTER SCIENCE
Subset sum; Subset-sum problem; Subset sums; Subset Sum; Sum of subsets; Subset-sum

numeral subset      

математика

числовое подмножество

cofinal set         
IN ORDER THEORY, A SUBSET 𝑌 OF A POSET 𝑋 SUCH THAT FOR ANY ELEMENT OF 𝑋, THERE EXISTS AN ELEMENT OF 𝑌 LARGER THAN IT
Cofinal subset; Cofinal function; Cofinal sequence; Cofinal net; Coinitial; Cofinal set; Final function

математика

конфинальное множество

coinitial         
IN ORDER THEORY, A SUBSET 𝑌 OF A POSET 𝑋 SUCH THAT FOR ANY ELEMENT OF 𝑋, THERE EXISTS AN ELEMENT OF 𝑌 LARGER THAN IT
Cofinal subset; Cofinal function; Cofinal sequence; Cofinal net; Coinitial; Cofinal set; Final function

геометрия

коинициальный

تعريف

Coinitial
·adj Having a common beginning.

ويكيبيديا

Subset sum problem

The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset S {\displaystyle S} of integers and a target-sum T {\displaystyle T} , and the question is to decide whether any subset of the integers sum to precisely T {\displaystyle T} . The problem is known to be NP-hard. Moreover, some restricted variants of it are NP-complete too, for example:

  • The variant in which all inputs are positive.
  • The variant in which inputs may be positive or negative, and T = 0 {\displaystyle T=0} . For example, given the set { 7 , 3 , 2 , 9000 , 5 , 8 } {\displaystyle \{-7,-3,-2,9000,5,8\}} , the answer is yes because the subset { 3 , 2 , 5 } {\displaystyle \{-3,-2,5\}} sums to zero.
  • The variant in which all inputs are positive, and the target sum is exactly half the sum of all inputs, i.e., T = 1 2 ( a 1 + + a n ) {\displaystyle T={\frac {1}{2}}(a_{1}+\dots +a_{n})} . This special case of SSP is known as the partition problem.

SSP can also be regarded as an optimization problem: find a subset whose sum is at most T, and subject to that, as close as possible to T. It is NP-hard, but there are several algorithms that can solve it reasonably quickly in practice.

SSP is a special case of the knapsack problem and of the multiple subset sum problem.

What is the الروسية for numeral subset? Translation of &#39numeral subset&#39 to الروسية